Self-consistent gradient flow for shape optimization
نویسندگان
چکیده
منابع مشابه
Self-consistent gradient flow for shape optimization
We present a model for image segmentation and describe a gradient-descent method for level-set based shape optimization. It is commonly known that gradient-descent methods converge slowly due to zig-zag movement. This can also be observed for our problem, especially when sharp edges are present in the image. We interpret this in our specific context to gain a better understanding of the involve...
متن کاملShape Optimization for Navier–Stokes Flow
Abstract. This paper is concerned with the optimal shape design of the newtonian viscous incompressible fluids driven by the stationary nonhomogeneous Navier–Stokes equations. We use three approaches to derive the structures of shape gradients for some given cost functionals. The first one is to use the Piola transformation and derive the state derivative and its associated adjoint state; the s...
متن کاملJustifying quasiparticle self-consistent schemes via gradient optimization in Baym-Kadanoff theory.
The question of which non-interacting Green's function 'best' describes an interacting many-body electronic system is both of fundamental interest as well as of practical importance in describing electronic properties of materials in a realistic manner. Here, we study this question within the framework of Baym-Kadanoff theory, an approach where one locates the stationary point of a total energy...
متن کاملGradient Flow Optimization for Reducing Blocking Effects of Transform Coding
This paper addresses the problem of reducing blocking effects in transform coding. A novel optimization approach using the gradient flow is proposed. Using some properties of the gradient flow on a manifold, an optimized filter design method for reducing the blocking effects is presented. Based on this method, an image reconstruction algorithm is derived. The algorithm maintains the fidelity of...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2016
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556788.2016.1171864